An Asynchronous Parallel Randomized Kaczmarz Algorithm
نویسندگان
چکیده
We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system Ax = b. The analysis shows linear convergence and indicates that nearly linear speedup can be expected if the number of processors is bounded by a multiple of the number of rows in A.
منابع مشابه
Fast distributed smoothing for network clock synchronization
We consider the problem of estimating node variables from noisy relative measurements in a wireless network. In previous work, a distributed smoothing scheme was developed based on the Jacobi algorithm for obtaining leastsquares (LS) estimates. Although the synchronous version of the algorithm was shown to converge exponentially to the optimal estimate, an analysis of the asynchronous scheme is...
متن کاملAccelerated Kaczmarz Algorithms using History Information
The Kaczmarz algorithm is a well known iterative method for solving overdetermined linear systems. Its randomized version yields provably exponential convergence in expectation. In this paper, we propose two new methods to speed up the randomized Kaczmarz algorithm by utilizing the past estimates in the iterations. The first one utilize the past estimates to get a preconditioner. The second one...
متن کاملRandomized Block Kaczmarz Method with Projection for Solving Least Squares
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...
متن کاملRandomized Extended Kaczmarz for Solving Least-Squares
We present a randomized iterative algorithm that exponentially converges in expectation to the minimum Euclidean norm least squares solution of a given linear system of equations. The expected number of arithmetic operations required to obtain an estimate of given accuracy is proportional to the square condition number of the system multiplied by the number of non-zeros entries of the input mat...
متن کاملPaved with Good Intentions: Analysis of a Randomized Block Kaczmarz Method
The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares problems. At each step, the algorithm projects the current iterate onto the solution space of a subset of the constraints. This paper describes a block Kaczmarz algorithm that uses a randomized control scheme to choose the subset at each step. This algorithm is the first block Kaczmarz method with an (expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.4780 شماره
صفحات -
تاریخ انتشار 2014